On the Implementation of a Fuzzy DL Solver over Infinite-Valued Product Logic with SMT Solvers
نویسندگان
چکیده
In this paper we explain the design and preliminary implementation of a solver for the positive satisfiability problem of concepts in a fuzzy description logic over the infinite-valued product logic. The same solver also works for 1-satisfiability in quasi-witnessed models. The solver works by first performing a direct reduction of the problem to a satisfiability problem of a quantifier free boolean formula with non-linear real arithmetic properties, and secondly solves the resulting formula with an SMT solver. We show that the satisfiability problem for such formulas is still a very challenging problem for even the most advanced SMT solvers, and so it represents an interesting problem for the community working on the theory and practice of SMT solvers. We briefly explain a possible way of improving the performance of the solver by an alternative implementation under development, based on a reduction to a boolean formula but with linear real arithmetic properties.
منابع مشابه
On the Implementation of a Fuzzy DL Solver over Infinite-Valued Product Logic with SMT Solvers
In this paper we explain the design and preliminary implementation of a solver for the positive satisfiability problem of concepts in a fuzzy description logic over the infinite-valued product logic. This very solver also answers 1-satisfiability in quasi-witnessed models. The solver works by first performing a direct reduction of the problem to a satisfiability problem of a quantifier free boo...
متن کاملDecidability of a Description Logic over Infinite-Valued Product Logic
This paper proves that validity and satisfiability of assertions in the Fuzzy Description Logic based on infinite-valued Product Logic with universal and existential quantifiers (which are non-interdefinable) is decidable when we only consider quasi-witnessed interpretations. We prove that this restriction is neither necessary for the validity problem (i.e., the validity of assertions in the Fu...
متن کاملAn Application of Formal Methods to Cognitive Radios
We discuss the design and implementation of a formal policy system regulating dynamic spectrum access (DSA) for cognitive radios. DSA policies are represented and manipulated in a proof framework based on first-order logic with arithmetic and algebraic data types. Various algebraic operations combining such policies can be easily implemented in such a framework. Reasoning about transmission req...
متن کاملDegree of Optimality as a Measure of Distance of Power System Operation from Optimal Operation
This paper presents an algorithm based on inter-solutions of having scheduled electricity generation resources and the fuzzy logic as a sublimation tool of outcomes obtained from the schedule inter-solutions. The goal of the algorithm is to bridge the conflicts between minimal cost and other aspects of generation. In the past, the optimal scheduling of electricity generation resources has been ...
متن کاملBeaver: An SMT Solver for Quantifier-free Bit-vector Logic
This thesis presents Beaver – an efficient SMT solver for the quantifier-free fixed-size bit-vector logic (QF BV). Beaver is an eager solver, that is, given an SMT formula, it first performs word-level simplications and then bitblasts the simplified formula to a Boolean formula, which is then solved using any SAT solver. Several engineering techniques are behind its efficiency: 1) efficient con...
متن کامل